A Bimachine Compiler for Ranked Tagging Rules
نویسندگان
چکیده
This paper describes a novel method of compiling ranked tagging rules into a deterministic nite-state device called a bimachine. The rules are formulated in the framework of regular rewrite operations and allow unrestricted regular expressions in both left and right rule contexts. The compiler is illustrated by an application within a speech synthesis system.
منابع مشابه
Rule Definition Language and a Bimachine Compiler
This paper presents a new Rule Definition Language (RDL) designed to allow fast and natural linguistic development of rule-based systems. We also describe a bimachine compiler for RDL which implements two novel methods: for bimachine construction and composition respectively. As an example usage of the presented framework we develop Porter’s stemming algorithm as a set of context-sensitive rewr...
متن کاملA Flexible Rule Compiler for Speech Synthesis
We present a exible rule compiler developed for a text-to-speech (TTS) system. The compiler converts a set of rules into a nite-state transducer (FST). The input and output of the FST are subject to parameterization, so that the system can be applied to strings and sequences of feature-structures. The resulting transducer is guaranteed to realize a function (as opposed to a relation), and there...
متن کاملCompiling and Using Finite-State Syntactic Rules
A language-independent framework for syntactic finlte-state parsing is discussed. The article presents a framework, a formalism, a compiler and a parser for g rammars written in this forrealism. As a substantial example, fragments from a nontrivial finite-state grammar of English are discussed. The linguistic framework of the present approach is based on a surface syntactic tagging scheme by F....
متن کاملPreference-Driven Bimachine Compilation. An Application to TTS Text Normalisation
This paper describes a grammar formalism and a deterministic parser developed for text normalisation in the rVoice text-to-speech (TTS) system. The rules are formulated using regular expressions and converted into a non-deterministic finite-state transducer (FST). At runtime, search is guided by parsing preferences which the user may associate with regular operators; the best solution is determ...
متن کاملPart of Speech Tagging with Discriminatively Re-ranked Hidden Markov Models
The task of part of speech tagging has been approached by various ways. Originally, constructed by way of hand-crafted rules for disambiguation, the majority of tagging is now accomplished by utilizing statistical machine learning methods. Two commonly applied statistical methods are hidden Markov models (HMM) and an extension of Markov chains combined with a maximum entropy classifier called m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره cs.CL/0407046 شماره
صفحات -
تاریخ انتشار 2004